2,980 research outputs found

    Finite 33-connected homogeneous graphs

    Full text link
    A finite graph \G is said to be {\em (G,3)(G,3)-((connected)) homogeneous} if every isomorphism between any two isomorphic (connected) subgraphs of order at most 33 extends to an automorphism g∈Gg\in G of the graph, where GG is a group of automorphisms of the graph. In 1985, Cameron and Macpherson determined all finite (G,3)(G, 3)-homogeneous graphs. In this paper, we develop a method for characterising (G,3)(G,3)-connected homogeneous graphs. It is shown that for a finite (G,3)(G,3)-connected homogeneous graph \G=(V, E), either G_v^{\G(v)} is 22--transitive or G_v^{\G(v)} is of rank 33 and \G has girth 33, and that the class of finite (G,3)(G,3)-connected homogeneous graphs is closed under taking normal quotients. This leads us to study graphs where GG is quasiprimitive on VV. We determine the possible quasiprimitive types for GG in this case and give new constructions of examples for some possible types

    The Cyclic Groups with them-DCI Property

    Get PDF
    AbstractFor a finite groupGand a subsetSofGwhich does not contain the identity ofG,let Cay(G,S)denote the Cayley graph ofGwith respect toS.If, for all subsetsS, TofGof sizem,Cay(G,S)≅Cay(G,T)impliesSα=Tfor someα∈Aut(G), thenGis said to have them-DCI property. In this paper, a classification is presented of the cyclic groups with them-DCI property, which is reasonably complete
    • …
    corecore